Multiple Solution Harvest Scheduling
نویسنده
چکیده
Application of the Metropolis algorithm for forest harvest scheduling is extended by automating the relative weighting of objective function components. Previous applications of the Metropolis algorithm require the user to specify these weights, which demands substantial trial and error in practice. This modification allows for general incorporation of objective function components that are either periodic or spatial in nature. A generic set of objective function components is developed to facilitate harvest scheduling for a wide range of problems. The resulting algorithm generates multiple feasible solutions rather than a single optimal solution.
منابع مشابه
A Forest Planning Approach with Respect to the Creation of Overmature Reserved Areas in Managed Forests
Forest harvest planning to maximize economic benefits also has to consider additional criteria such as the biodiversity functioning of the managed forest. The biodiversity requirements are determined by the size, shape, and distribution of harvest units and forest stands. A multiple criteria approach is presented where the harvesting volume is maximized while the environmental aspects are also ...
متن کاملHarvest scheduling algorithm to equalize supplier benefits: A case study from the Thai sugar cane industry
In this study, the harvest scheduling problem of a group of cane growers in Thailand is addressed. Each member in a group is required to consistently supply sugar cane to a mill for the entire harvest season. However, the current scheduling does not account for the time-variant cane production of each cane field, which leads to unequal opportunities for growers to harvest. A portion of growers ...
متن کاملSPATIAL MODELING A Three-Stage Heuristic for Harvest Scheduling with Access Road Network Development
In this article we present a new model for the scheduling of forest harvesting with spatial and temporal constraints. Our approach is unique in that we incorporate access road network development into the harvest scheduling selection process. Due to the difficulty of solving the problem optimally, we develop a heuristic that consists of a solution construction stage and two solution improvement...
متن کاملGrid Harvest Service: A System for Long-Term, Application-Level Task Scheduling
With the emergence of grid computing environment, performance measurement, analysis and prediction of non-dedicated distributed systems have become increasingly important. In this study, we put forward a novel performance model for non-dedicated network computing. Based on this model, a performance prediction and task scheduling system called Grid Harvest Service (GHS), has been designed and im...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کامل